def quick_sort(b):
    if len(b) < 2:
        return b
    mid = b[len(b) // 2]
    left, right = [], []
    b.remove(mid)
    for item in b:
        if item >= mid:
            right.append(item)
        else:
            left.append(item)
    return quick_sort(left) + [mid] + quick_sort(right)


b= [11,99,33,69,77,88,55,11,33,36,39,66,44,22]
b = quick_sort(b)
print(b)
